Expected numbers at hitting times
نویسنده
چکیده
We determine exactly the expected number of hamilton cycles in the random graph obtained by starting with n isolated vertices and adding edges at random until each vertex degree is at least two. This complements recent work of Cooper and Frieze. There are similar results concerning expected numbers for example of perfect matchings, spanning trees, hamilton paths and directed hamilton cycles.
منابع مشابه
Supplementary materials and proofs
2 Hitting times 3 2.1 Typical hitting times are large . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Exponential mixing on spatial graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Expected hitting times degenerate to the stationary distribution . . . . . . . . . . . . . . . . 6 2.4 The case of one dimension . . . . . . . . . . . . . . . ....
متن کاملHitting and commute times in large graphs are often misleading
Next to the shortest path distance, the second most popular distance function between vertices in a graph is the commute distance (resistance distance). For two vertices u and v, the hitting time Huv is the expected time it takes a random walk to travel from u to v. The commute time is its symmetrized version Cuv = Huv + Hvu. In our paper we study the behavior of hitting times and commute dista...
متن کاملFinding hitting times in various graphs
The hitting time, huv , of a random walk on a finite graph G, is the expected time for the walk to reach vertex v given that it started at vertex u. We present two methods of calculating the hitting time between vertices of finite graphs, along with applications to specific classes of graphs, including grids, trees, and the ’tadpole’ graphs. keywords: random walks, hitting time
متن کاملSimple random walks on wheel graphs
A simple random walk on a graph is defined in which a particle moves from one vertex to any adjacent vertex, each with equal probability. The expected hitting time is the expected number of steps to get from one vertex to another before returning to the starting vertex. In this paper, using the electrical network approach, we provide explicit formulae for expected hitting times for simple rando...
متن کاملHitting probabilities and expected hitting times under a weak drift: on the 1/3-rule and beyond
When does a small drift increase the hitting probability of a boundary point / the expected hitting time of the boundary, compared to the driftless case? We analyze this for diffusion processes on [0,1] by expanding the Green function. In this way, in the appropriate diffusion approximation setting, we rederive and extend the one-third rule of evolutionary game theory (Nowak et al., 2004) and e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 15 شماره
صفحات -
تاریخ انتشار 1991